Interpolation of finite order entire functions

Interpolation and Approximation by Entire Functions

In this note we study the connection between best approximation and interpolation by entire functions on the real line. A general representation for entire interpolants is outlined. As an illustration, best upper and lower approximations from the class of functions of fixed exponential type to the Gaussian are constructed. §1. Approximation Background The Fourier transform of φ ∈ L(R) is define...

Cover interpolation functions and h-enrichment in finite element method

This paper presents a method to improve the generation of meshes and the accuracy of numerical solutions of elasticity problems, in which two techniques of h-refinement and enrichment are used by interpolation cover functions. Initially, regions which possess desired accuracy are detected. Mesh improvment is done through h-refinement for the elements existing in those regions. Total error of th...

q-Taylor theorems, polynomial expansions, and interpolation of entire functions

We establish q-analogues of Taylor series expansions in special polynomial bases for functions analytic in bounded domains and for entire functions whose maximum modulus Mðr; f Þ satisfies jln Mðr; f ÞjpA ln r: This solves the problem of constructing such entire functions from their values at 1⁄2aq þ q =a =2; for 0oqo1: Our technique is constructive and gives an explicit representation of the s...

Interpolation of entire functions, product formula for basic sine function

On the Number of Zeros of Successive Derivatives of Entire Functions of Finite Order

1 We use this occasion to point out that the condition lim inf log M (r) < 1 r-+c g(r) in Theorem 2 of [1] can be replaced by the somewhat weaker condition : there exists a, sequence r1, + oo such that log M (r,,) < g(r1,). It is clear from the proof that only this is actually used . Thus the following assertion is true THEOREM B. Let g(r) denote an arbitrary increasing function, defined in 0 <...